Sparse Gaussian Elimination on High Performance Computers
نویسندگان
چکیده
Sparse Gaussian Elimination on High Performance Computers
منابع مشابه
Sparse Gaussian Elimination on High Performance
Sparse Gaussian Elimination on High Performance Computers
متن کاملThe Impact of Hardware Gather/Scatter on Sparse Gaussian Elimination
Recent vector supercomputers provide vector memory access to "randomly" indexed vectors, whereas early vector supercomputers required contiguously or regularly indexed vectors. This additional capability, known as "hardware gather/scatter," can be used to great effect in general sparse Gaussian elimination. In this note we present some examples that show the impact of this change in hardware on...
متن کاملTechniques for Parallel Manipulation of Sparse Matrices
New techniques are presented forthe manipulation of sparse matrices on parallel MIMD computers. We consider the following problems: matrix addition, matrix multiplication, row and column permutation, matrix transpose, matrix vector multiplication, and Gaussian elimination.
متن کاملA Scalable Sparse Direct Solver Using Static Pivoting
We propose several techniques as alternatives to partial pivoting to stabilize sparse Gaussian elimination. From numerical experiments we demonstrate that for a wide range of problems the new method is as stable as partial pivoting. The main advantage of the new method over partial pivoting is that it permits a priori determination of data structures and communication pattern, which makes it mo...
متن کاملParallel Sparse Gaussian Elimination with Partial Pivoting and 2-d Data Mapping Parallel Sparse Gaussian Elimination with Partial Pivoting and 2-d Data Mapping Abstract Parallel Sparse Gaussian Elimination with Partial Pivoting and 2-d Data Mapping
Sparse Gaussian elimination with partial pivoting is a fundamental algorithm for many scientiic and engineering applications, but it is still an open problem to develop a time and space eecient algorithm on distributed memory machines. In this thesis, we present an asynchronous algorithm which incorporates static symbolic factorization, nonsymmetric L/U supernode partitioning and supern-ode ama...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1996